Skip to main content
Log in

Inter-intra cellular pilot contamination mitigation for heterogeneous massive MIMO cellular systems

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Massive multiple-input-multiple-output (MIMO) technology has been advocated as one of the most advanced and promising technologies for catering to the high data requirements of present and future cellular networks. It can be achieved by the installation of hundreds or thousands of antennas at the base station (BS), for serving tens of users. For making proper use of its high gain capabilities, it is required for the BS to have full knowledge of the channel between the users and itself which is obtained using channel state information (CSI). Pilot contamination has been identified as a major hindrance in the error-free computation of CSI. In this paper, a heterogeneous massive MIMO cellular system has been considered where the number of users present in different cells are assumed to be different. Moreover, the same pilots are reused by the users of each cell. This gives rise to the scenario of both inter-cellular and intra-cellular pilot contamination in the massive MIMO cellular system approach. To mitigate these aforesaid pilot contamination, two sub-optimal algorithms have been proposed in this correspondence which allocate the available same pilots to various users in a systematic manner based upon their perceived interference. In the first approach, the intra-cellular pilot contamination has been addressed before addressing the inter-cellular pilot contamination. The inter-cellular pilot contamination has been resolved ahead of the intra-cellular pilot contamination as per the second approach. Both these algorithms are designed with the aim of maximizing the system throughput. Hence, pilots with low interference are allocated to better channel conditioned users and vice-versa. On different performance parameters, the algorithms are evaluated and the simulation results show that the second pilot allocation strategy is more successful than the first scheme incurring the same computational complexity. Moreover, the effectiveness of the proposed algorithms have been presented by comparing with existing pilot contamination mitigation algorithms for various system metrics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Availability of data and material:

Not applicable

References

  1. Verenzuela, D., Björnson, E., & Sanguinetti, L. (2018). Spectral and energy efficiency of superimposed pilots in uplink massive MIMO. IEEE Transactions on Wireless Communications, 17(11), 7099–7115.

    Article  Google Scholar 

  2. Baofeng Ji, K. S. C. L. H. W., Xing, Bingbing., & Yang, L. (2018). “Performance analysis of multi hop relaying caching for internet of things under nakagami channels,” Wireless Communications and Mobile Computing,. [Online]. Available: https://www.hindawi.com/journals/wcmc/2018/2437361/cta/

  3. Zhang, X., Guo, D., Ani, K., Ma, W., & Guo, K. (2020). Secure transmission and power allocation in multiuser distributed massive MIMO systems. Wireless Networks, 26(2), 941–954.

    Article  Google Scholar 

  4. Marzetta, T. L. (2010). Noncooperative cellular wireless with unlimited numbers of base station antennas. IEEE Transactions on Wireless Communications, 9(11), 3590–3600.

    Article  Google Scholar 

  5. Lago, L. A., Zhang, Y., Akbar, N., Fei, Z., Yang, N., & He, Z. (2020). Pilot decontamination based on superimposed pilots assisted by time-multiplexed pilots in massive MIMO networks. IEEE Transactions on Vehicular Technology, 69(1), 405–417.

    Article  Google Scholar 

  6. Larsson, E. G., Edfors, O., Tufvesson, F., & Marzetta, T. L. (2014). Massive MIMO for next generation wireless systems. IEEE Communications Magazine, 52(2), 186–195.

    Article  Google Scholar 

  7. Dey, A., Pattanayak, P., & Gurjar, D. S. (2021). Pilot contamination in massive MIMO communications. In: Mandloi M., Gurjar D., Pattanayak P., Nguyen H. (eds) 5G and Beyond Wireless Systems. Springer Series in Wireless Technology. Springer, Singapore., pp. 21–42.

  8. Chen, J., Wen, C., Jin, S., & Wong, K. (2017). A low complexity pilot scheduling algorithm for massive MIMO. IEEE Wireless Communications Letters, 6(1), 18–21.

    Google Scholar 

  9. Stein Ioushua, S., & Eldar, Y. C. (2020). Pilot sequence design for mitigating pilot contamination with reduced RF chains. IEEE Transactions on Communications, 68(6), 3536–3549.

    Article  Google Scholar 

  10. Dey, A., Pattanayak, P., Gurjar, D. S., Kumar, P. (2021). Efficient pilot reuse algorithms for massive MIMO cellular system International Journal of Communication Systems, 34(3) e4682-e4682 dac.4682. [Online]. Available: https://onlinelibrary.wiley.com/doi/abs/10.1002/dac.4682.

  11. Björnson, E., Larsson, E. G., & Debbah, M. (2014). Optimizing multi-cell massive MIMO for spectral efficiency: How many users should be scheduled? in 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP), pp. 612–616.

  12. Dey, A., Pattanayak, P., & Gurjar, D.S. (2021). Arithmetic/geometric progression based pilot allocation with antenna scheduling for massive MIMO cellular systems. IEEE Networking Letters, pp. 1–1.

  13. Wei, X., Peng, W., Chen, D., Schober, R., & Jiang, T. (2018). Uplink channel estimation in massive MIMO systems using factor analysis. IEEE Communications Letters, 22(8), 1620–1623.

    Article  Google Scholar 

  14. Ngo, H. Q., Larsson, E. G., & Marzetta, T. L. (2013). Energy and spectral efficiency of very large multiuser MIMO systems. IEEE Transactions on Communications, 61(4), 1436–1449.

    Article  Google Scholar 

  15. Shafin, R., & Liu, L. (2020). Superimposed pilot for multi-cell multi-user massive FD-MIMO systems. IEEE Transactions on Wireless Communications, 19(5), 3591–3606.

    Article  Google Scholar 

  16. Dey, A., & Pattanayak, P. (2021). “Pilot decontamination with pilot scheduling for 5G communications,” Arabian Journal for Science and Engineering.

  17. Appaiah, K., Ashikhmin, A., & Marzetta, T. L. (2010). Pilot contamination reduction in multi-user TDD systems. in 2010 IEEE International Conference on Communications, pp. 1–5.

  18. Liu, L., & Yu, W. (2018). Massive connectivity with massive MIMO-part ii: Achievable rate characterization. IEEE Transactions on Signal Processing, 66(11), 2947–2959.

    Article  Google Scholar 

  19. Stein Ioushua, S., & Eldar, Y. C. (2020). Pilot sequence design for mitigating pilot contamination with reduced rf chains. IEEE Transactions on Communications, 68(6), 3536–3549.

    Article  Google Scholar 

  20. Mäller, R. R., Cottatellucci, L., & Vehkaperä, M. (2014). Blind pilot decontamination. IEEE Journal of Selected Topics in Signal Processing, 8(5), 773–786.

    Article  Google Scholar 

  21. Ngo, H. Q., & Larsson, E.G. (2012). Evd-based channel estimation in multicell multiuser mimo systems with very large antenna arrays. in 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3249–3252.

  22. Jose, J., Ashikhmin, A., Marzetta, T. L., & Vishwanath, S. (2011). Pilot contamination and precoding in multi-cell tdd systems. IEEE Transactions on Wireless Communications, 10(8), 2640–2651.

    Article  Google Scholar 

  23. Yin, H., Gesbert, D., Filippou, M., & Liu, Y. (2013). A coordinated approach to channel estimation in large-scale multiple-antenna systems. IEEE Journal on Selected Areas in Communications, 31(2), 264–273.

    Article  Google Scholar 

  24. Fernandes, F., Ashikhmin, A., & Marzetta, T. L. (2013). Inter-cell interference in noncooperative tdd large scale antenna systems. IEEE Journal on Selected Areas in Communications, 31(2), 192–201.

    Article  Google Scholar 

  25. Ahmadi, H., Farhang, A., Marchetti, N., & MacKenzie, A. (2016). A game theoretic approach for pilot contamination avoidance in massive mimo. IEEE Wireless Communications Letters, 5(1), 12–15.

    Article  Google Scholar 

  26. Van Chien, T., Nguyen Canh, T., Björnson, E., & Larsson, E. G. (2020). Power control in cellular massive mimo with varying user activity: A deep learning solution. IEEE Transactions on Wireless Communications, 19(9), 5732–5748.

    Article  Google Scholar 

  27. Ali, E., Ismail, M., Nordin, R., & Abdulah, N. F. (2019). Beamforming with 2d-aoa estimation for pilot contamination reduction in massive mimo. Telecommunication Systems, 71, 541–552.

    Article  Google Scholar 

  28. S, R., & Akhlaghpasand, H. (2017). Adaptive pilot decontamination in multi-cell massive mimo networks. Telecommunication Systems, 66, 515–522.

    Article  Google Scholar 

  29. Marzetta, T. L. (2006). How much training is required for multiuser MIMO? in 2006 Fortieth Asilomar Conference on Signals, Systems and Computers, pp. 359–363.

  30. Zhao, J., Ni, S., Gong, Y., & Zhang, Q. (2019). Pilot contamination reduction in TDD-based massive MIMO systems. IET Communications, 13(10), 1425–1432.

    Article  Google Scholar 

  31. Nguyen, H. V., Nguyen, V., Nguyen, H. M., & Shin, O. (2018). Uplink training with pilot optimisation for multicell massive multiple-input multiple-output systems. IET Communications, 12(15), 1778–1787.

    Article  Google Scholar 

  32. Jin, S., Li, M., Huang, Y., Du, Y., & Gao, X. (2015). Pilot scheduling schemes for multi-cell massive multiple-input multiple-output transmission. IET Communications, 9(5), 689–700.

    Article  Google Scholar 

  33. Björnson, E., Hoydis, J., & Sanguinetti, L. (2017). Massive MIMO networks: Spectral, energy, and hardware efficiency. Now Foundations and Trends,.

  34. Nguyen, T. H., Chien, T. V., Ngo, H. Q., Tran, X. N., & Björnson, E. (2021). Pilot assignment for joint uplink-downlink spectral efficiency enhancement in massive mimo systems with spatial correlation. IEEE Transactions on Vehicular Technology, 70(8), 8292–8297.

    Article  Google Scholar 

Download references

Funding

Not applicable

Author information

Authors and Affiliations

Authors

Contributions

Not applicable

Corresponding author

Correspondence to Prabina Pattanayak.

Ethics declarations

Conflict of interest

On behalf of all authors, the corresponding author states that there is no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Abhinaba Dey and Prabina Pattanayak have contributed equally to this work.

Computational complexity analysis

Computational complexity analysis

1.1 Computational complexity analysis of the proposed algorithms

Considering the first algorithm, the complexity of finding the cell index having minimum user \(K_{min}\) is given by,

$$\begin{aligned} V_1 = O(L). \end{aligned}$$
(A1)

Iterations for finding the best user in the target cell along with its highest matched antenna along with BS antenna and alloting it a pilot is,

$$\begin{aligned} V_2 = MK_{min}N. \end{aligned}$$
(A2)

Thus, total iterations required for alloting all the P pilots in the target cell,

$$\begin{aligned} V_3&=PMK_{min}N \nonumber \\&=MK_{min}^2N, \text { since } P = K_{min}. \end{aligned}$$
(A3)

Similaly, the total iterations required for alloting the P pilots to all the users present in the other cells (except the target cell) is,

$$\begin{aligned} V_4&=(L-1)PMK_{l}N\dfrac{K_l}{P}, \nonumber \\&=(L-1)MK_{l}^2N, \end{aligned}$$
(A4)

where \(\dfrac{K_l}{P}\) denotes the number of reuses in that cell. Hence, total iterations required for allocating pilots to all the users,

$$\begin{aligned} V_5&=V_4+V_3 \nonumber \\&=(L-1)MK_{l}^2N+MK_{min}^2N \nonumber \\&\approxeq LMK_{total}^2N. \end{aligned}$$
(A5)

Finally, the total computational complexity of the entire process,

$$\begin{aligned} T&=V_1+V_5 \nonumber \\&=O(L)+O(LMK_{total}^2N) \nonumber \\&\approxeq O(LMK_{total}^2N), \text { since } LMK_{total}^2N>> L. \end{aligned}$$
(A6)

Both the proposed algorithms have the same computational complexity.

1.2 Computational complexity analysis of the ESA

The complexity of finding the cell index having minimum user among all cells, \(K_{min}\) is given by,

$$\begin{aligned} V_1 = O(L). \end{aligned}$$
(A7)

Total number of combinations that can be formed with user number, user antenna number and BS antenna number is given by,

$$\begin{aligned} X = MK_{min}N. \end{aligned}$$
(A8)

For each combination in the above expression, the number of combinations in the next randomly chosen cell with K\(_{l}\) users is given by,

$$\begin{aligned} X_{l} = MK_{l}N. \end{aligned}$$
(A9)

Thus, for total number of combinations to be checked to reach the optimal solution, is given by,

$$\begin{aligned} J&= \prod _{i=1}^{L} X_{l}, \nonumber \\&= MK_{1}N \times MK_{2}N \times \ldots \times MK_{L}N, \nonumber \\&= (MK_{min}N)^L\prod _{i=1}^{L} R_{l}, \end{aligned}$$
(A10)

where \(R_{l}\) is the reuse factor of \(l_{th}\) cell. Thus the total computational complexity of ESA is given by,

$$\begin{aligned} C&= O(J) + V_1 \nonumber \\&\approxeq O(J) = O((MK_{min}N)^L\prod _{i=1}^{L} R_{l}) \end{aligned}$$
(A11)

1.3 Computational complexity analysis of the OPA [30]

From [30], we know that the complexity of the OPA strategy is given as \(O\left( K_{active}log(K_{active})\right) \), where K\(_{active}\) is the number of users present within the considered area. When we implement the algorithm for our system model, number of BS antennas as well as user antennas come into account, which alters the complexity slightly. The updated complexity of the OPA scheme can then be given as \(O\left( K_{active}MNlog(K_{active}MN)\right) \).

1.4 Computational complexity analysis of the JPO [31]

From [31], we know that the complexity of the JPO strategy is given as \(O\left( K\chi _p^3+K\chi _pM\right) \), where K is the number of users. When we implement the algorithm in our system model, number of user antennas also come into account, which alters the complexity slightly. The updated complexity of the JPO scheme can then be given as \(O\left( K_{total}\chi _p^3+K_{total}\chi _pMN\right) \).

1.5 Computational complexity analysis of the RA scheme

Choosing a target cell l, the number of ways in which any random user may be selected from all users for assigning the first pilot is,

$$\begin{aligned} C_l=M \times N \end{aligned}$$
(A12)

For all the K\(_{l}\) users in the l\(_{th}\) cell, number of iterations required is,

$$\begin{aligned} C_2=K_l \times M \times N \end{aligned}$$
(A13)

Hence for all the cells, the number of iterations required is,

$$\begin{aligned} C_3=M \times N \times L \times \sum _{l=1}^L K_l = MNLK_{total}, \end{aligned}$$
(A14)

where \(K_{total} = \sum _{l=1}^L K_l\). Thus, the computational complexity of RA strategy is of the order of \(O\left( MNLK_{total}\right) \).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dey, A., Pattanayak, P. Inter-intra cellular pilot contamination mitigation for heterogeneous massive MIMO cellular systems. Telecommun Syst 80, 91–103 (2022). https://doi.org/10.1007/s11235-022-00889-z

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-022-00889-z

Keywords

Navigation